Expansive automata networks

Expansive Invertible Onesided Cellular Automata

We study expansive invertible onesided cellular automata (i.e., expansive automorphisms of onesided full shifts) and find severe dynamical and arithmetic constraints which provide partial answers to questions raised by M. Nasu [N2]. We employ the images and bilateral dimension groups, measure multipliers, and constructive combinatorial characterizations for two classes of cellular automata.

Expansive Aggregation in Wireless Sensor Networks for Linear Infrastructure

A sensor network is a network consisting of several small, wireless, resource-limited nodes that sense data about their environment and report readings to some central base station. One of the ways through which power can be conserved in a sensor network is to aggregate sensor readings hop-byhop as they travel towards a central base station. Using this approach the total number of messages requ...

Stochastic Automata Networks

Generalized Automata Networks

In this work standard lattice cellular automata and random Boolean networks are extended to a wider class of generalized automata networks having any graph topology as a support. Dynamical, computational, and problem solving capabilities of these automata networks are then discussed through selected examples, and put into perspective with respect to current and future research.

Preconditioning for Stochastic Automata Networks

LANGVILLE, AMY N. Preconditioning for Stochastic Automata Networks. (Under the direction of William J. Stewart.) Many very large Markov chains can be modeled efficiently as Stochastic Automata Networks (SANs). A SAN is composed of individual automata that, for the most part, act independently, requiring only infrequent interaction. SANs represent the generator matrix Q of the underlying Markov ...